Constructing higher-order topological states in higher dimensions

نویسندگان

چکیده

Higher-order topological phases as the generalization of Berry attract an enormous amount research. The current theoretical models supporting higher-order phases, however, cannot give connection between lower-order and when extending lattice from lower to higher dimensions. Here, we theoretically propose experimentally demonstrate a corner state constructed edge states in one-dimensional lattice. two-dimensional square owns independent spatial modulation coupling each direction, combination two directions comes up lattice, revealing phase lower- higher-dimensional lattices. Our work deepens understanding breaking through dimensions, provides promising tool constructing structures.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constructing higher-order Voronoi diagrams in parallel

We use Lee’s sequential algorithm [17] to create the first parallel algorithm which constructs the order-k Voronoi diagram of a planar point set. The algorithm is developed and analyzed within two parallel models, the fine-grained PRAM and the coarse-grained CGM. Its applications include k-nearest neighbor searches in a parallel context, which are important for many applications in computationa...

متن کامل

Constructing Logic Programs with Higher-Order Predicates

This paper proposes a logic programming approach based on the application of a system of higher-order predicates put at disposal within ordinary logic programming languages such as prolog. These higher-order predicates parallel the higher-order functionals or combinators which form an established part of contemporary functional programming methodology. The suggested toolbox of higher-order pred...

متن کامل

Constructing Levels in Arrangements and Higher Order Voronoi Diagrams 1 Constructing Levels in Arrangements and Higher Order Voronoi Diagrams

We give simple randomized incremental algorithms for computing the k-level in an arrangement of n hyperplanes in two-and three-dimensional space. The expected running time of our algorithms is O(nk + nn(n) log n) for the planar case, and O(nk 2 + n log 3 n) for the three-dimensional case. Both bounds are optimal unless k is very small. The algorithm generalizes to computing the k-level in an ar...

متن کامل

Topological Completeness for Higher-Order Logic

Using recent results in topos theory, two systems of higher-order logic are shown to be complete with respect to sheaf models over topological spaces—so-called “topological semantics”. The first is classical higherorder logic, with relational quantification of finitely high type; the second system is a predicative fragment thereof with quantification over functions between types, but not over a...

متن کامل

Topological Models for Higher Order Control Flow

Semantic models are presented for two simple imperative languages with higher order constructs. In the rst language the interesting notion is that of second order assignment x := s, for x a procedure variable and s a statement. The second language extends this idea by a form of higher order communication, with statements c ! s and c ? x, for c a channel. We develop operational and denotational ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical Review B

سال: 2021

ISSN: ['1098-0121', '1550-235X', '1538-4489']

DOI: https://doi.org/10.1103/physrevb.104.224303